Resource augmented semi-online bounded space bin packing
نویسندگان
چکیده
منابع مشابه
Resource augmented semi-online bounded space bin packing
We study on-line bounded space bin-packing in the resource augmentation model of competitive analysis. In this model, the on-line bounded space packing algorithm has to pack a list L of items with sizes in (0, 1], into a minimum number of bins of size b, b ≥ 1. A bounded space algorithm has the property that it only has a constant number of active bins available to accept items at any point dur...
متن کاملBounded-space online bin cover
In this paper, we look at the online bounded-space bin cover problem and show how we can use the language of Markov chains to model and analyze the problem. We will use the insights given by the Markov chains to design an algorithm for the online bounded-space bin cover problem. The algorithm is a heuristic that we create by simplifying the Markov chain. We also show how we can use simple metho...
متن کاملTwo-Bounded-Space Bin Packing Revisited
We analyze approximation algorithms for bounded-space bin packing by comparing them against the optimal bounded-space packing (instead of comparing them against the globally optimal packing that does not necessarily satisfy the bounded-space constraint). For 2-boundedspace bin packing we construct a polynomial time offline approximation algorithm with asymptotic worst case ratio 3/2, and we sho...
متن کاملOnline Bin Packing with Resource Augmentation
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an algorithm were given the entire input in advance, it could give an optimal solution (in exponential time). Instead of giving the algorithm more knowledge about the input, in this paper we consider the effects of giving...
متن کاملOnline algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
In this paper, we study 1-space bounded multi-dimensional bin packing and hypercube packing. A sequence of items arrive over time, each item is a d-dimensional hyperbox (in bin packing) or hypercube (in hypercube packing), and the length of each side is no more than 1. These items must be packed without overlapping into d-dimensional hypercubes with unit length on each side. In d-dimensional sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.03.015